Optimal Color Range Reporting in One Dimension
نویسندگان
چکیده
Color (or categorical) range reporting is a variant of the orthogonal range reporting problem in which every point in the input is assigned a color. While the answer to an orthogonal point reporting query contains all points in the query range Q, the answer to a color reporting query contains only distinct colors of points in Q. In this paper we describe an O(N)-space data structure that answers one-dimensional color reporting queries in optimal O(k + 1) time, where k is the number of colors in the answer and N is the number of points in the data structure. Our result can be also dynamized and extended to the external memory
منابع مشابه
Shared-Constraint Range Reporting
Orthogonal range reporting is one of the classic and most fundamental data structure problems. (2,1,1) query is a 3 dimensional query with two-sided constraint on the first dimension and one sided constraint on each of the 2nd and 3rd dimension. Given a set of N points in three dimension, a particular formulation of such a (2, 1, 1) query (known as four-sided range reporting in threedimension) ...
متن کاملEquivalent a posteriori error estimates for spectral element solutions of constrained optimal control problem in one dimension
In this paper, we study spectral element approximation for a constrained optimal control problem in one dimension. The equivalent a posteriori error estimators are derived for the control, the state and the adjoint state approximation. Such estimators can be used to construct adaptive spectral elements for the control problems.
متن کاملNear-Optimal Range Reporting Structures for Categorical Data
Range reporting on categorical (or colored) data is a well-studied generalization of the classical range reporting problem in which each of the N input points has an associated color (category). A query then asks to report the set of colors of the points in a given rectangular query range, which may be far smaller than the set of all points in the query range. We study two-dimensional categoric...
متن کاملConcurrent Range Reporting in Two-Dimensional Space
In the concurrent range reporting (CRR) problem, the input is L disjoint sets S1, ..., SL of points in R d with a total of N points. The goal is to preprocess the sets into a structure such that, given a query range r and an arbitrary set Q ⊆ {1, ..., L}, we can efficiently report all the points in Si ∩ r for each i ∈ Q. The problem was studied as early as 1986 by Chazelle and Guibas [9] and ha...
متن کاملProvide an optimal audit model to reduce fraudulent financial reporting
Fraud in financial reporting and accounting has grown significantly in recent years due to the financial crises created in companies, so that fraud has become a political and economic issue and today the legislature, the accounting profession and the causes The creation of fraud in it as well as the ways to deal with fraudulent behavior in financial statements have received special attention. T...
متن کامل